Nonce words show that Russian yer alternations are governed by the grammar

Graphs Capturing Alternations in Words

A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x, y) ∈ E for each x 6= y. If W is k-uniform (each letter of W occurs exactly k times in it) then G is called k-representable. A graph is representable if and only if it is k-representable for some k [1]. In this note, we introduce the applicability of represe...

The predictability of vowel alternations in Urban Hijazi Arabic imperfective nonce forms

Identifying Words that are Musically Meaningful

A musically meaningful vocabulary is one of the keystones in building a computer audition system that can model the semantics of audio content. If a word in the vocabulary is not clearly represented by the underlying acoustic representation, the word can be considered noisy and should be removed from the vocabulary. This paper proposes an approach to construct a vocabulary of predictive semanti...

Nonce Generators and the Nonce Reset Problem

A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream ciphers, block cipher modes of operation, and message authentication codes. Nonetheless, the correct generation of nonces is rarely discussed in the cryptographic literature. In this paper, we collect a number of nonce...

Alternations: From Lexicon to Grammar And Back Again

An excellent example of a phenomenon bridging a lexicon and a grammar is provided by grammaticalized alternations (e.g., passivization, reflexivity, and reciprocity): these alternations represent productive grammatical processes which are, however, lexically determined. While grammaticalized alternations keep lexical meaning of verbs unchanged, they are usually characterized by various changes ...